package leet.ku._70;

public class Solution {
	public int climbStairs(int n) {
		int last = 1;
		int now = 1;
		for (int i = 2; i <= n; i++) {
			int tmp = now;
			now = last + now;
			last = tmp;
		}
		return now;
	}
}
